A reduced semantics for deciding trace equivalence using constraint systems

Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e., without replication) by means of symbolic execution and constraint solving. However, this does not suffice to obtain practical tools. Current prototypes suffer from a classical combinatorial explosion problem caused by the exploration of many interleavings in the behaviour of processes. M\"odersheim et al. have tackled this problem for reachability properties using partial order reduction techniques. We revisit their work, generalize it and adapt it for equivalence checking. We obtain an optimization in the form of a reduced symbolic semantics that eliminates redundant interleavings on the fly.Comment: Accepted for publication at POST'1

Near-Perfect Correlation of the Resistance Components of Mesoscopic Samples at the Quantum Hall Regime

We study the four-terminal resistance fluctuations of mesoscopic samples near the transition between the $\nu=2$ and the $\nu=1$ quantum Hall states. We observe near-perfect correlations between the fluctuations of the longitudinal and Hall components of the resistance. These correlated fluctuations appear in a magnetic-field range for which the two-terminal resistance of the samples is quantized. We discuss these findings in light of edge-state transport models of the quantum Hall effect. We also show that our results lead to an ambiguity in the determination of the width of quantum Hall transitions.Comment: As publishe

Fluctuating Hall resistance defeats the quantized Hall insulator

Using the Chalker-Coddington network model as a drastically simplified, but universal model of integer quantum Hall physics, we investigate the plateau-to-insulator transition at strong magnetic field by means of a real-space renormalization approach. Our results suggest that for a fully quantum coherent situation, the quantized Hall insulator with R_H approx. h/e^2 is observed up to R_L ~25 h/e^2 when studying the most probable value of the distribution function P(R_H). Upon further increasing R_L ->\infty the Hall insulator with diverging Hall resistance R_H \propto R_L^kappa is seen. The crossover between these two regimes depends on the precise nature of the averaging procedure.Comment: major revision, discussion of averaging improved; 8 pages, 7 figures; accepted for publication in EP

Confluence reduction for Markov automata

Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosion threatens the analysability of the models generated by such specifications. We therefore introduce confluence reduction for Markov automata, a powerful reduction technique to keep these models small. We define the notion of confluence directly on Markov automata, and discuss how to syntactically detect confluence on the MAPA language as well. That way, Markov automata generated by MAPA specifications can be reduced on-the-fly while preserving divergence-sensitive branching bisimulation. Three case studies demonstrate the significance of our approach, with reductions in analysis time up to an order of magnitude

The quantized Hall effect in the presence of resistance fluctuations

We present an experimental study of mesoscopic, two-dimensional electronic systems at high magnetic fields. Our samples, prepared from a low-mobility InGaAs/InAlAs wafer, exhibit reproducible, sample specific, resistance fluctuations. Focusing on the lowest Landau level we find that, while the diagonal resistivity displays strong fluctuations, the Hall resistivity is free of fluctuations and remains quantized at its $\nu=1$ value, $h/e^{2}$. This is true also in the insulating phase that terminates the quantum Hall series. These results extend the validity of the semicircle law of conductivity in the quantum Hall effect to the mesoscopic regime.Comment: Includes more data, changed discussio

Abstract Interpretation with Unfoldings

We present and evaluate a technique for computing path-sensitive interference conditions during abstract interpretation of concurrent programs. In lieu of fixed point computation, we use prime event structures to compactly represent causal dependence and interference between sequences of transformers. Our main contribution is an unfolding algorithm that uses a new notion of independence to avoid redundant transformer application, thread-local fixed points to reduce the size of the unfolding, and a novel cutoff criterion based on subsumption to guarantee termination of the analysis. Our experiments show that the abstract unfolding produces an order of magnitude fewer false alarms than a mature abstract interpreter, while being several orders of magnitude faster than solver-based tools that have the same precision.Comment: Extended version of the paper (with the same title and authors) to appear at CAV 201

Two-Dimensional Electron Gas in InGaAs/InAlAs Quantum Wells

We designed and performed low temperature DC transport characterization studies on two-dimensional electron gases confined in lattice-matched In$_{0.53}$Ga$_{0.47}$As/In$_{0.52}$Al$_{0.48}$As quantum wells grown by molecular beam epitaxy on InP substrates. The nearly constant mobility for samples with the setback distance larger than 50nm and the similarity between the quantum and transport life-time suggest that the main scattering mechanism is due to short range scattering, such as alloy scattering, with a scattering rate of 2.2 ps$^{-1}$. We also obtain the Fermi level at the In$_{0.53}$Ga$_{0.47}$As/In$_{0.52}$Al$_{0.48}$As surface to be 0.36eV above the conduction band, when fitting our experimental densities with a Poisson-Schr\"odinger model.Comment: Accepted in Applied Physics Letter

A Framework to Synergize Partial Order Reduction with State Interpolation

We address the problem of reasoning about interleavings in safety verification of concurrent programs. In the literature, there are two prominent techniques for pruning the search space. First, there are well-investigated trace-based methods, collectively known as "Partial Order Reduction (POR)", which operate by weakening the concept of a trace by abstracting the total order of its transitions into a partial order. Second, there is state-based interpolation where a collection of formulas can be generalized by taking into account the property to be verified. Our main contribution is a framework that synergistically combines POR with state interpolation so that the sum is more than its parts

A well-separated pairs decomposition algorithm for k-d trees implemented on multi-core architectures

Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.Variations of k-d trees represent a fundamental data structure used in Computational Geometry with numerous applications in science. For example particle track tting in the software of the LHC experiments, and in simulations of N-body systems in the study of dynamics of interacting galaxies, particle beam physics, and molecular dynamics in biochemistry. The many-body tree methods devised by Barnes and Hutt in the 1980s and the Fast Multipole Method introduced in 1987 by Greengard and Rokhlin use variants of k-d trees to reduce the computation time upper bounds to O(n log n) and even O(n) from O(n2). We present an algorithm that uses the principle of well-separated pairs decomposition to always produce compressed trees in O(n log n) work. We present and evaluate parallel implementations for the algorithm that can take advantage of multi-core architectures.The Science and Technology Facilities Council, UK